Method for finding multiple roots of polynomials

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of Collocation Method in Finding Roots

In this paper we present a new method to find simple or multiple roots of functions in a finite interval. In this method using bisection method we can find an interval such that this function is one to one on it, thus we can transform problem of finding roots in this interval into an ordinary differential equation with boundary conditions. By solving this equation using collocation method we ca...

متن کامل

Finding roots of polynomials over finite fields

In this letter, we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose–Chaudhuri–Hocquenghem, Reed–Solomon, and some other error-correcting codes.

متن کامل

Probabilistic algorithm for finding roots of linearized polynomials

A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial

متن کامل

Improved hybrid algorithm for finding roots of error-locator polynomials

In this paper we suggest a hybrid method for finding toots of error locator polynomials. We first review a fast version of the Chien search algorithm based on the decomposition of the error locator polynomial into a sum of multiples of affine polynomials. We then propose to combine it with modified analytical methods for solution of polynomials of small degree in radicals. We suggest, in partic...

متن کامل

Computing multiple roots of inexact polynomials

We present a combination of two novel algorithms that accurately calculate multiple roots of general polynomials. For a given multiplicity structure and initial root estimates, Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and calculates multiple roots simultaneously. To fulfill the input requirement of Algorithm I, we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2006

ISSN: 0898-1221

DOI: 10.1016/j.camwa.2005.07.018